Efficient Second-Order Predicate Schema Matching Algorithm

A schema is an abstracted or a generalized knowledge to help with solving problems. A second-order predicate schema matching is a problem of computing the matchers of a pair 〈P, p〉 such that P is a second-order predicate schema and p is a first order closed formula. The second-order matching is known as NP-complete,in general. We propose a new matching algorithm based on the pre-checking of the usable rules, and show that an efficient matching algorithm can be established under this approach for some classes which are important from practical view point.